Resultaten visas 1 - 10 / 959
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År
Publicationer information ikon

Exponential lower bounds of lattice counts by vertical sum and 2-sum

Referentgranskad
Öppen tillgång
DOI
10.1007/s00012-019-0586-4
Kohonen, Jukka
Algebra Universalis2019Publicationer information ikon

Cartesian Lattice Counting by the Vertical 2-sum

Referentgranskad
Öppen tillgång
DOI
10.1007/s11083-021-09569-0
Kohonen, Jukka
ORDER: A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS2021Publicationer information ikon

Vertical Externalities with Lump-Sum Taxes:

Referentgranskad
Öppen tillgång
Tomas Sjögren; Diego Martinez
European Journal of Government and Economics2014Publicationer information ikon

Revisiting the Random Subset Sum Problem

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.ESA.2023.37
da Cunha, Arthur; d'Amore, Francesco; Giroire, Frédéric; Lesfari, Hicham; Natale, Emanuele; Viennot,...
Leibniz International Proceedings in Informatics (LIPIcs)2023Publicationer information ikon

On the regular sum-free sets

Referentgranskad
DOI
10.1016/j.ejc.2015.02.030
Wen, Zhi-Xiong; Zhang, Jie-Meng; Wen, Wu
European journal of combinatorics2015Publicationer information ikon

Modelling of vertical drains

Referentgranskad
Stapelfeldt, Timo
-2007Publicationer information ikon

Dense Subset Sum may be the hardest

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.STACS.2016.13
Austrin, Per; Kaski, Petteri; Koivisto, Mikko; Nederlof, Jesper
Leibniz International Proceedings in Informatics2016Publicationer information ikon

Subset Sum in the absence of concentration

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.STACS.2015.48
Austrin, Per; Kaski, Petteri; Koivisto, Mikko Kalle Henrik; Nederlof, Jesper
Leibniz International Proceedings in Informatics2015Publicationer information ikon

The simplified weighted sum function and its average sensitivity

Referentgranskad
DOI
10.1016/j.ipl.2016.01.002
Li, Jiyou; Luo, Chu
Information processing letters2016Publicationer information ikon

Group vertical handoff management in heterogeneous networks

Referentgranskad
DOI
10.1002/wcm.2599
Walid, Abdellaziz; Kobbane, Abdellatif; Mabrouk, Abdelfettah; Sabir, Essaid; Taleb, Tarik; El Koutbi...
Wireless Communications and Mobile Computing2015

Exponential lower bounds of lattice counts by vertical sum and 2-sum

Referentgranskad
Öppen tillgång
DOI
10.1007/s00012-019-0586-4
2019

Cartesian Lattice Counting by the Vertical 2-sum

Referentgranskad
Öppen tillgång
DOI
10.1007/s11083-021-09569-0
2021

Vertical Externalities with Lump-Sum Taxes:

Referentgranskad
Öppen tillgång
2014

Revisiting the Random Subset Sum Problem

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.ESA.2023.37
2023

On the regular sum-free sets

Referentgranskad
DOI
10.1016/j.ejc.2015.02.030
2015

Modelling of vertical drains

Referentgranskad
2007

Dense Subset Sum may be the hardest

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.STACS.2016.13
2016

Subset Sum in the absence of concentration

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.STACS.2015.48
2015

The simplified weighted sum function and its average sensitivity

Referentgranskad
DOI
10.1016/j.ipl.2016.01.002
2016

Group vertical handoff management in heterogeneous networks

Referentgranskad
DOI
10.1002/wcm.2599
2015